package com.jiajia.study;


import com.jiajia.study.printer.BinaryTrees;

/**
 * @author : zjj
 * @date : 2021/1/18 14:34
 */
public class Client {


    public static void main(String[] args) {
        test1();
    }

    /**
     * 测试二叉搜索树的添加功能
     */
    private static void test1(){
        BinarySearchTree<Integer> binarySearchTree =new BinarySearchTree<>();
        Integer[] data = new Integer[]{57, 47, 49, 56, 55, 85, 36, 8, 74, 67};
        for (int i = 0; i < data.length; i++) {
            binarySearchTree.add(data[i]);
        }
        BinaryTrees.println(binarySearchTree);

        //binarySearchTree.preorderTraversal();
    }
}
